Convex Polyhedra with Triangular Faces and Cone Triangulation
نویسندگان
چکیده
Considering the problem of the minimal triangulation for a given polyhedra (dividing polyhedra into tetrahedra) it is known that the cone triangulation provides the number of tetrahedra which is the smallest, or the closest to it. It is also shown that when we want to know whether the cone triangulation is the minimal one, it is necessary to find the order of all vertices, as well as the order of “separating circles”. Here, we will give algorithms for testing the necessary condition for the cone triangulation if it is the minimal one. The algorithm for forming the cone triangulation will also be given.
منابع مشابه
Ununfoldable polyhedra with convex faces
Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. In particular, we give two examples of polyhedra, one with 24 convex faces and one with 36 triangular faces, that cannot be unfolded by cutting along edges. We further ...
متن کاملDiscrete strip-concave functions, Gelfand-Tsetlin patterns, and related polyhedra
Discrete strip-concave functions considered in this paper are, in fact, equivalent to an extension of Gelfand-Tsetlin patterns to the case when the pattern has a not necessarily triangular but convex configuration. They arise by releasing one of the three types of rhombus inequalities for discrete concave functions (or “hives”) on a “convex part” of a triangular grid. The paper is devoted to a ...
متن کاملDecoration of the Truncated Tetrahedron - An Archimedean Polyhedron - To Produce a New Class of Convex Equilateral Polyhedra with Tetrahedral Symmetry
The Goldberg construction of symmetric cages involves pasting a patch cut out of a regular tiling onto the faces of a Platonic host polyhedron, resulting in a cage with the same symmetry as the host. For example, cutting equilateral triangular patches from a 6.6.6 tiling of hexagons and pasting them onto the full triangular faces of an icosahedron produces icosahedral fullerene cages. Here we s...
متن کاملThree-Dimensional Boundary-Constrained Triangulations
We discuss the problem of generating a boundary-constrained tetrahedral mesh in a convex polyhedron, where the triangular meshes on the boundary faces of the polyhedron are given. These boundary-constrained triangulations are used in our nite element tetrahedral mesh generation method (which includes a convex poly-hedron decomposition step), since a boundary face may be common to two convex pol...
متن کاملInterpolation Error Estimates for Harmonic Coordinates on Polytopes
Interpolation error estimates in terms of geometric quality measures are established for harmonic coordinates on polytopes in two and three dimensions. First we derive interpolation error estimates over convex polygons that depend on the geometric quality of the triangles in the constrained Delaunay triangulation of the polygon. This characterization is sharp in the sense that families of polyg...
متن کامل